Periodic Solutions of the Planar N-center Problem with Topological Constraints
نویسنده
چکیده
In the planar N-center problem, for a non-trivial free homotopy class of the configuration space satisfying certain mild condition, we show that there is at least one collision free T -periodic solution for any positive T. We use the direct method of calculus of variations and the main difficulty is to show that minimizers under certain topological constraints are free of collision.
منابع مشابه
A NEW MEMETIC SWARM OPTIMIZATION FOR SPECTRAL LAYOUT DESIGN OF BRACED FRAMES
For most practical purposes, true topology optimization of a braced frame should be synchronized with its sizing. An integrated layout optimization is formulated here to simultaneously account for both member sizing and bracings’ topology in such a problem. Code-specific seismic design spectrum is applied to unify the earthquake excitation. The problem is solved for minimal structural weight un...
متن کاملPlatonic Polyhedra , Topological Constraints and Periodic Solutions of the Classical N - Body Problem
We prove the existence of a number of smooth periodic motions u∗ of the classical Newtonian N–body problem which, up to a relabeling of the N particles, are invariant under the rotation group R of one of the five Platonic polyhedra. The number N coincides with the order |R| of R and the particles have all the same mass. Our approach is variational and u∗ is a minimizer of the Lagrangean action ...
متن کاملMinimizing the Number of Tardy Jobs in the Single Machine Scheduling Problem under Bimodal Flexible and Periodic Availability Constraints
In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the durati...
متن کاملSymmetric periodic orbits for the n-body problem: some preliminary results
We show the existence of some infinite families of periodic solutions of the planar Newtonian n-body problem –with positive masses– which are symmetric with respect to suitable actions of finite groups (under a strong–force assumption or only numerically). The method is by minimizing a discretization of the action functional under symmetry constraints.
متن کاملI/O-Efficient Algorithms for Planar Graphs I: Separators∗
We present I/O-efficient algorithms for computing optimal separator partitions of planar graphs. Our main result shows that, given a planar graph G with N vertices and an integer r > 0, a vertex separator of size O (N/√r) that partitions G into O(N/r) subgraphs of size at most r and boundary size O (√r) can be computed in O(sort(N)) I/Os, provided that M ≥ 56r log B. Together with the planar em...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015